A Reranking Method Using Query Expansion and PageRank Check
نویسندگان
چکیده
منابع مشابه
Query Reranking As A Service
Many web databases are “hidden” behind proprietary search interfaces that enforce the top-k output constraint, i.e., each query returns at most k of all matching tuples, preferentially selected and returned according to a proprietary ranking function. In this paper, we initiate research into the novel problem of skyline discovery over top-k hidden web databases. Since skyline tuples provide cri...
متن کاملQuery Architecture Expansion in Web Using Fuzzy Multi Domain Ontology
Due to the increasing web, there are many challenges to establish a general framework for data mining and retrieving structured data from the Web. Creating an ontology is a step towards solving this problem. The ontology raises the main entity and the concept of any data in data mining. In this paper, we tried to propose a method for applying the "meaning" of the search system, But the problem ...
متن کاملA Proposal of Query Expansion Method Using Fuzzy Abductive Inference
This paper proposes a query expansion method using fuzzy abductive inference. This query expansion method for information retrieval is useful, because unexpected related information are probably be obtained by adding new words to the query. The fuzzy abductive inference is the inference method based on Peng and Reggia's abductive inference. This method infers irredundant combinations of concept...
متن کاملA new query expansion method based on query logs mining
Query expansion has long been suggested as an effective way to improve the performance of information retrieval systems by adding additional relevant terms to the original queries. However, most previous research has been limited in extracting new terms from a subset of relevant documents, but has not exploited the information about user interactions. In this paper, we proposed a method for aut...
متن کاملProbabilistic Query Expansion Method Based on a Query Recommendation Algorithm
Query Expansion Methods are proposed to solve many problems of information retrieval systems, but most of these methods do not use the information of interactions between the users and the system. In our approach, we applied a Query Recommendation Algorithm on a list of past user queries, to extract the most associated queries to the input query, and used it in a Probabilistic Query Expansion m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartB
سال: 2011
ISSN: 1598-284X
DOI: 10.3745/kipstb.2011.18b.4.231